Quickest Change Detection
نویسندگان
چکیده
The problem of detecting changes in the statistical properties of a stochastic system and time series arises in various branches of science and engineering. It has a wide spectrum of important applications ranging from machine monitoring to biomedical signal processing. In all of these applications the observations being monitored undergo a change in distribution in response to a change or anomaly in the environment, and the goal is to detect the change as quickly as possibly, subject to false alarm constraints. In this chapter, two formulations of the quickest change detection problem, Bayesian and minimax, are introduced, and optimal or asymptotically optimal solutions to these formulations are discussed. Then some generalizations and extensions of the quickest change detection problem are described. The chapter is concluded with a discussion of applications and open issues.
منابع مشابه
Data-Efficient Quickest Change Detection
In the classical problem of quickest change detection, a decision maker observes a sequence of random variables. At some point in time, the distribution of the random variables changes abruptly. The objective is to detect this change in distribution with minimum possible delay, subject to a constraint on the false alarm rate. In many applications of quickest change detection, e.g., where the ch...
متن کاملQuickest Detection of Drift Change for Brownian Motion in Generalized Bayesian and Minimax Settings
The paper deals with the quickest detection of a change of the drift of the Brownian motion. We show that the generalized Bayesian formulation of the quickest detection problem can be reduced to the optimal stopping problem for a diffusion Markov process. For this problem the optimal procedure is described and its characteristics are found. We show also that the same procedure is asymptotically...
متن کاملQuickest detection of intensity change for Poisson process in generalized Bayesian setting
The paper deals with the quickest detection of intensity change for Poisson process. We show that the generalized Bayesian formulation of the quickest detection problem can be reduced to the conditional-extremal optimal stopping problem for a piecewise-deterministic Markov process. For this problem the optimal procedure is described and its characteristics are found.
متن کاملDiscussion on “ Sequential Detection / Isolation of Abrupt Changes ” by Igor
In this interesting paper Professor Nikiforov reviewed the current state of quickest change detection/isolation problem. In our discussion of his paper we focus on the concerns and the opportunities of the subfield of quickest change detection, or more generally, sequential methodologies, in the modern
متن کاملQuickest Detection with Social Learning: Interaction of local and global decision makers
We consider how local and global decision policies interact in stopping time problems such as quickest time change detection. Individual agents make myopic local decisions via social learning, that is, each agent records a private observation of a noisy underlying state process, selfishly optimizes its local utility and then broadcasts its local decision. Given these local decisions, how can a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1210.5552 شماره
صفحات -
تاریخ انتشار 2012